BA网络中一种基于节点动态权值的局部路由策略

为适应大规模通信网络的路由需求,提出了一种基于BA网络的局部路由策略。基本思想是在数据包转发过程中,将邻居节点的度和发送能力以一定比例加和得到的值作为权值,根据权值大小选择下一站点。其中,节点的发送能力由节点的数据包队列长度,节点的度及一个调节系数组成,节点的发送能力可根据实时数据包产生率进行调节。仿真结果表明,该路由策略有较好的通讯能力,通过改变加权算法中的比例系数可以调节网络的临界负载量,达到该算法下的最优路由方法,使节点的处理能力得到合理利用,为实际大规模通讯网络中利用局部路由实现数据传输提供了有效可靠的方法。     

音频播控系统改造设计方案浅析

介绍了音频播控系统设计方案的总体结构,分析了智能化主控系统的性能,并详细阐述了系统的设备配置及利用总控系统软件控制各种硬件设备,实现协同工作的特点.通过技术改造,从系统方案到设备配置实现了一个全数字信号路由、智能化的电台系统.     

基于位置感知和代理的WSN多径路由方案

针对无线传感器网络(WSN)中多径路由的可靠性和能量效率问题,提出了一种基于代理和位置感知的多径路由发现方案(LABMR).事件节点根据位置信息,动态寻找其到Sink节点之间的特殊中间节点,来构建多径路由.利用移动代理来收集多径路由的局部拓扑结构信息,Sink节点根据代理收集的路由参数来计算路径权值,以此选择最优不相交路径.同时,对于信息的重要性差异,Sink节点选择单条或多条路径来传输数据,在保证传输可靠性的同时减少能耗.与现有的基于代理的多径路由(ABMR)方法相比,LABMP在数据包投递率、能量消耗、额外开销和延迟方面具有更好的性能.     

基于ERPMT改进启发式方法的WSN寿命最大化算法

针对传感器节点的电池容量限制导致无线传感网络寿命低的问题,基于容量最大化(CMAX)、线上最大化寿命(OML)两种启发式方法以及高效路由能量管理技术(ERPMT),提出了基于ERPMT改进启发式方法的无线传感网络寿命最大化算法。首先,通过启发式方法初始化每个传感器节点,将节点能量划分为传感器节点起源数据和其它节点数据延迟;然后利用加入的一种优先度量延迟一跳节点的能量消耗;最后,根据路径平均能量为每个路由分配一个优先级,并通过ERPMT实现最终的无线传感网络优化。针对不同分布类型网络寿命的实验验证了本文算法的有效性及可靠性,实验结果表明,相比较为先进的启发式方法CMAX及OML,本文算法明显增大了无线传感网络的覆盖范围,并且大大地延长了网络的寿命。     

基于新型故障搜寻策略的检测系统设计

为了达到复杂系统快速故障搜寻的目的,设计了一种基于二元决策图优化的新型故障搜寻策略的检测系统设计。通过对基于二元决策图优化的故障搜寻方法研究和实际的硬件电路设计,最终实现了检测系统的软硬件设计。使用这种方法能够很好的实现故障诊断系统在嵌入式平台的开发,并能够取得较好的诊断效果。     

基于Chord的移动对等网络资源路由算法

针对移动P2P云环境下节点由于移动太快导致路由算法失效的问题,提出一种基于Chord资源路由算法。该算法修改基本路由结构,并设置实时机制和检查机制,实时机制在每次查找过程中实时修改路由信息,检查机制是检查路径节点是否为有效节点,并修改路径节点路由信息,提供给下次查询使用。实验结果表明,该算法有效提高查询成功率,同时减少查询延时。     

可充电无线传感器网络动态拓扑问题研究

在可充电无线传感器网络中的能量补给设备兼任数据采集设备的情况下,提出了可充电无线传感器网络时变动态拓扑模型,并在此基础上根据最大化能量补给设备驻站时间比为目标提出了最优化问题。通过分析不同时刻不同传感器节点和无线能量补给/数据采集设备的工作情况及需要遵循的约束条件,得到与原问题具有等优性的多状态线性规划问题。求解该优化问题,获得可充电无线传感器网络动态拓扑下的周期动态路由和无线能量补给/数据采集设备的工作策略。与之前的研究成果相比,优化目标值均有20%以上的提升。     

Integrated multi-factory production and distribution scheduling applying vehicle routing approach

This paper introduces a new integrated multi-factory production and distribution scheduling problem in supply chain management. This supply chain consists of a number of factories joined together in a network configuration. The factories produce intermediate or finished products and supply them to other factories or to end customers that are distributed in various geographical zones. The problem consists of finding a production schedule together with a vehicle routing solution simultaneously to minimise the sum of tardiness cost and transportation cost. A mixed-integer programming model is developed to tackle the small-sized problems using CPLEX, optimally. Due to the NP-hardness, to deal with medium- and large-sized instances, this paper develops a novel Improved Imperialist Competitive Algorithm (IICA) employing a local search based on simulated annealing algorithm. Performance of the proposed IICA is compared with the optimal solution and also with four variants of population-based metaheuristics: Imperialist Competitive Algorithm, Genetic Algorithm, Particle Swarm Optimisation (PSO), and Improved PSO. Based on the computational results, it is statistically shown that quality of the IICA’s solutions is the same as optimal ones solving small problems. It also outperforms other algorithms in finding near-optimal solutions dealing with medium and large instances in a reasonably short running time.     

Novel method for transferring access control list rules to synchronize security protection in a locator/identifier separation protocol environment with cross‐segment host mobility

Extended access control lists (ACLs) are used to filter packets for network security. However, in current network frameworks, ACL rules are not transferred simultaneously with devices that move across network segments. The Internet Engineering Task Force proposed the Locator/Identifier Separation Protocol (LISP), which enables routers (xTRs) to configure ACL rules for blocking immobile endpoint identifiers (EIDs). However, when an EID moves from the original xTR to a new xTR, the ACL rules at the original xTR cannot be transferred with the EID. Thus, the new xTR lacks the corresponding ACL rules to effectively block the EID, resulting in security risks. The highlights of this study are as follows. First, a method is proposed for dynamically transferring ACL rules in LISP environments and frameworks. Second, the map‐register and map‐notify protocols were combined to encapsulate and transfer the ACL rules and thus obviate an additional process required to transfer these rules. Third, the experimental results verified that the proposed method can be used to achieve synchronized security protection in an LISP environment involving cross‐segment EID movements.     

基于SDN的互联网域间路由研究

互联网流量的爆发式增长,叠加互联网流量固有的突发性特点,使得网络流量不均衡现象日益加剧。传统BGP协议由于缺乏全网拓扑和全局流量观,只能遵循标准BGP选路原则,在解决流量调度和负载均衡方面存在不足。针对BGP协议存在的局限性,研发了基于RR+的互联网骨干网流量调度系统,并应用于ChinaNet骨干网的网内中继、网间互联出口、IDC出口等多个流量优化场景。更进一步地,提出了一种基于SDN的互联网域间路由架构,通过在域间控制器之间交换BGP路由,无需在域内和域间运行BGP协议,极大地简化了网络协议,并能够实现灵活的流量调度和负载均衡。